A simulated annealing for reconstructing hv-convex binary matrices
نویسندگان
چکیده
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two projections. This variant is reformulated as an integer programming problem and approximated by simulated annealing approach.
منابع مشابه
Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing
This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results ...
متن کاملAn Empirical Study of Reconstructing hv-Convex Binary Matrices from Horizontal and Vertical Projections
The reconstruction of hv-convex binary matrices (or equivalently, binary images) from their horizontal and vertical projections is proved to be NPhard. In this paper we take a closer look at the difficulty of the problem. We investigate different heuristic reconstruction algorithms of the class, and compare them from the viewpoint of running-time and reconstruction quality. Using a large set of...
متن کاملOn the Ambiguity of Reconstructing hv-Convex Binary Matrices with Decomposable Configurations
Reconstructing binary matrices from their row, column, diagonal, and antidiagonal sums (also called projections) plays a central role in discrete tomography. One of the main difficulties in this task is that in certain cases the projections do not uniquely determine the binary matrix. This can yield an extremely large number of (sometimes very different) solutions. This ambiguity can be reduced...
متن کاملReconstruction of hv-convex binary matrices from their absorbed projections
The reconstruction of hv-convex binary matrices from their absorbed projections is considered. Although this problem is NP-hard if the non-absorbed row and column sums are available, it is proved that such a reconstruction problem can be solved in polynomial time from absorbed projections when the absorption is represented by =(1+ √ 5)=2. Also a reconstruction algorithm is given to determine th...
متن کاملReconstructing Convex Matrices by Integer Programming Approaches
We consider the problem of reconstructing two-dimensional convex binary matrices from their row and column sums with adjacent ones. Instead of requiring the ones to occur consecutively in each row and column, we maximize the number of adjacent ones. We reformulate the problem by using integer programming and we develop approximate solutions based on linearization and convexification techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 36 شماره
صفحات -
تاریخ انتشار 2010